package graph

// barnacles: hangers-on for vertices which would hold data that ideally would
// be partitioned somewhere else but it's really efficient to store it in the
// vertex. This is mostly path processing information right now.

type bfsBarn struct {
 Prev *Vertex;
 Dist int;
}

func newBfsBarn() (*bfsBarn) {
  // empty for now but the factory method
  // makes it easier to add init steps later
  return new(bfsBarn);
}